Generalizing the induced matching by edge capacity constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature matching based on corner and edge constraints

The principle underpinning stereo vision—comparing like but disparate images—is essential for calculating distances in applications that include 3D recognition, aircraft navigation, and motion analysis. A critical component of such calculations is matching image features, in particular corners and edges, which simplifies search space by extracting essential information from complex data. But fe...

متن کامل

A Bottleneck Matching Problem with Edge-Crossing Constraints

Motivated by a crane assignment problem, we consider a Euclidean bipartite matching problem with edge-crossing constraints. Speci cally, given n red points and n blue points in the plane, we want to construct a perfect matching between red and blue points that minimizes the length of the longest edge, while imposing a constraint that no two edges may cross each other. We show that the problem i...

متن کامل

Oligopoly with Capacity Constraints and Thresholds

    Abstract   Extended Oligopoly models will be introduced and examined in which the firms might face capacity limits, thresholds for minimal and maximal moves, and antitrust thresholds in the case of partial cooperation. Similar situation occurs when there is an additional cost of output adjustment, which is discontinuous at zero due to set-up costs. In these cases the payoff functions of the...

متن کامل

Object Recognition by Matching Symbolic Edge Graphs

We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combination of an operator modeling cortical end-stopped cells. Graphs are constructed by line-following between corners. Model matching is then done by nding subgraph isomorphisms in the image graph. The complexity is red...

متن کامل

Plane parameter estimation by edge set matching

A new method for plane hypothesis generation based on a sweeping process is presented. The method is feature based in contradiction to earlier methods which rely on image correlation. The features used are edgel elements (’edgels’) which are extracted in a preprocessing step. The experiments show an improvement in speed as well as in accuracy.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Optimization

سال: 2007

ISSN: 1572-5286

DOI: 10.1016/j.disopt.2006.11.004